|
Imre Bárány (Mátyásföld, 7 December 1947) is a Hungarian mathematician, working in combinatorics and discrete geometry. He works at the Rényi Mathematical Institute of the Hungarian Academy of Sciences, and has a part-time job at University College London. == Notable results== * He gave a surprisingly simple alternative proof of Lovász's theorem on Kneser graphs.〔 * He gave a new proof to the Borsuk–Ulam theorem.〔 * Barany gave a colored version of Carathéodory's theorem.〔(【引用サイトリンク】title=DBLP Bibliography )〕 * He solved an old problem of Sylvester〔J. J. Sylvester, ''Problem 1491''. The Educational Times, April, 1864, London〕 on the probability of random point sets in convex position.〔Bárány, Imre, ''Sylvester's question: the probability that n points are in convex position''. Annals of Probability, vol. 27 (1999), no. 4, pp. 2020–2034〕 * With Vu proved a central limit theorem on random points in convex bodies.〔 * With Füredi he gave an algorithm for mental poker.〔 * With Füredi he proved that no deterministic polynomial time algorithm determines the volume of convex bodies in dimension ''d'' within a multiplicative error ''d''''d''. * With Füredi and Pach he proved the following six circle conjecture of Fejes Tóth: if in a planar circle packing each circle is tangent to at least 6 other circles, then either it is the hexagonal system of circles with identical radii, or there are circles with arbitrarily small radius. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Imre Bárány」の詳細全文を読む スポンサード リンク
|